Challenges for Routing and Search in Dynamic and Self-organizing Networks

Search methods in self-organizing networks usually cannot rely on stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are available, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partial knowledge in the network to reach a destination, but the search effort naturally increases with the lack of precise paths due to network dynamics. This problem is especially relevant for wireless technology with strict limitation on power consumption/ We address the efficiency of random walks and flooding for exploring networks based on case studies evaluated by simulation and transient analysis. In this way, performance tradeoffs are demonstrated when combining shortest path routing with randomized techniques.